Heuristic solutions to robust variants of the minimum-cost integer flow problem
نویسندگان
چکیده
منابع مشابه
A Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملHeuristic solutions for general concave minimum cost network flow problems
We address the single-source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be NP-Hard. Therefore, approximate methods are more suitable. In this work, we present a hybrid approach combining...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملA heuristic light robust approach to increase the quality of robust solutions
In this paper, the optimizations problems to seek robust solutions under uncertainty are considered. The light robust approach is one of the strong and new methods to achieve robust solutions under conditions of uncertainty. In this paper, we tried to improve the quality of the solutions obtained from the Light Robust method by introducing a revised approach. Considering the problem concerned, ...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2020
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-020-09441-1